Resolution of an Antenna–Satellite assignment problem by means of Integer Linear Programming
نویسندگان
چکیده
منابع مشابه
Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
The Quadratic Assignment Problem (QAP) can be solved by linearization, where one formulates the QAP as a mixed integer linear programming (MILP) problem. On the one hand, most of these linearization are tight, but hardly exploited within a reasonable computing time because of their size. On the other hand, Kaufman and Broeckx formulation [1] is the smallest of these linearizations, but very wea...
متن کاملAn L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem
This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...
متن کاملOn the integer max-linear programming problem
For a generic class of matrices we show that integer solutions to two-sided max-linear systems and programs can be found in polynomial time. For general matrices we adapt the existing methods for finding real solutions to obtain algorithms for finding integer solutions.
متن کاملWord Sense Disambiguation as an Integer Linear Programming Problem
We present an integer linear programming model of word sense disambiguation. Given a sentence, an inventory of possible senses per word, and a sense relatedness measure, the model assigns to the sentences’s word occurrences the senses that maximize the total pairwise sense relatedness. Experimental results show that our model, with two unsupervised sense relatedness measures, compares well agai...
متن کاملAn integer linear programming approach for bilinear integer programming
We introduce a new Integer Linear Programming (ILP) approach for solving Integer Programming (IP) problems with bilinear objectives and linear constraints. The approach relies on a series of ILP approximations of the bilinear IP. We compare this approach with standard linearization techniques on random instances and a set of real-world product bundling problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Aerospace Science and Technology
سال: 2014
ISSN: 1270-9638
DOI: 10.1016/j.ast.2014.06.002